Two simplified proofs for Roberts' theorem
نویسندگان
چکیده
Roberts (1979) showed that every social choice function that is ex-post implementable in private value settings must be weighted VCG, i.e. it maximizes the weighted social welfare. This paper provides two simplified proofs for this. The first proof uses the same underlying key-point, but significantly simplifies the technical construction around it, thus helps to shed light on it. The second proof builds on monotonicity conditions identified by Rochet [11] and Bikhchandani et. al. [2]. This proof is for a weaker statement that assumes an additional condition of “player decisiveness”.
منابع مشابه
Geometric Proofs of Mather’s Connecting and Accelerating Theorems
In this paper we present simplified proofs of two important theorems of J.Mather. The first (connecting) theorem [Ma2] is about wandering trajectories of exact area-preserving twist maps naturally arising for Hamiltonian systems with 2 degrees of freedom. The second (accelerating) theorem is about dynamics of generic time-periodic Hamiltonian systems on twotorus (2.5-degrees of freedom). Mather...
متن کاملStructure in Hardware Proofs: First Steps Towards Automation in a Higher-Order Environment
Most proofs of hardware in an higher-order logic environment follow a definite pattern. This observation is used to give a methodology for hardware proofs in order to isolate the situations where the designer’s creativity is required, and to automate the remaining tedious proof tasks. The interactive HOL theorem prover has been extended by generalized hardware specific tactics for simplifying p...
متن کاملA simplified proof of the Gohberg-Sigal-Rouché theorem
The GSR theorem generalizes the classical Rouché theorem of complex analysis, concerning the stability of the total multiplicity of “roots minus poles” for finitely meromorphic functions taking values in the space of Fredholm operators on a Hilbert space. This theorem has been a very useful tool in the stability analysis of nonlinear waves. Proofs based on logarithmic integrals are usually cons...
متن کاملTowards the Compression of First-Order Resolution Proofs by Lowering Unit Clauses
The recently developed LowerUnits algorithm compresses propositional resolution proofs generated by SATand SMT-solvers by postponing and lowering resolution inferences involving unit clauses, which have exactly one literal. This paper describes a generalization of this algorithm to the case of first-order resolution proofs generated by automated theorem provers. An empirical evaluation of a sim...
متن کاملAn induction measure on λ-terms and its applications
A useful induction measure on A-terms is presented here. Combining leftmost reduction with subterm reduction, we introduce a new notion called W-reduction for untyped A-calculus. Since a subterm reduction is only performed on a term when it is in an empty context, the H-reduction is really a relation in a more rigorous sense. We then prove the equivalence between strong normalisability and Ti-n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Social Choice and Welfare
دوره 32 شماره
صفحات -
تاریخ انتشار 2009